1805C - Place for a Selfie - CodeForces Solution

#include <bits/stdc++.h>

using namespace std;

using i64 = long long;

void solve() {
    int n, m;
    cin >> n >> m;
    
    vector<int> k(n);
    for (int i = 0; i < n; i++) {
        cin >> k[i];
    }
    
    sort(k.begin(), k.end());
    
    for (int i = 0; i < m; i++) {
        int a, b, c;
        cin >> a >> b >> c;
        
        bool ok = true;
        int j = lower_bound(k.begin(), k.end(), b) - k.begin();
        for (auto i : {j - 1, j}) {
            if (i < 0 || i >= n) {
                continue;
            }
            int x = k[i];
            i64 v = 1LL * (b - x) * (b - x) - 4LL * a * c;
            if (v < 0) {
                ok = false;
                cout << "YES\n";
                cout << x << "\n";
                break;
            }
        }
        
        if (ok) {
            cout << "NO\n";
        }
    }
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    
    int t;
    cin >> t;
    
    while (t--) {
        solve();
    }
    
    return 0;
}